Some remarks on domination
نویسندگان
چکیده
Proof: The proof is by induction on |V (G)| + |E(G)|. The smallest graph as described in the lemma is K1,3, for which the statement holds. This gives the start of our induction. Let x = |X| and y = |Y |. If there exists a vertex v in Y of degree at least 4, then delete any edge e incident to v. The subset A of G− e guaranteed by the inductive hypothesis is adjacent in G to every vertex in Y as desired. So we may assume that the vertices in Y are all of
منابع مشابه
Two Remarks on the Domination Number of Graphs
This paper consists of two loosely related notes on the domination number of graphs. In the first part, we provide a new upper bound for the domination number of d-regular graphs. Our bound is the best known for d ≥ 6. In the second part, we compute the exact domination number and total domination number of certain Kneser graphs, and we provide some bounds on the domination number of other Knes...
متن کاملSome Remarks on Α-domination
Let α ∈ (0, 1) and let G = (VG, EG) be a graph. According to Dunbar, Hoffman, Laskar and Markus [3] a set D ⊆ VG is called an α-dominating set of G, if |NG(u)∩D| ≥ αdG(u) for all u ∈ VG \D. We prove a series of upper bounds on the α-domination number of a graph G defined as the minimum cardinality of an α-dominating set of G.
متن کاملNon Split Domination on Intuitionistic Fuzzy Graphs
A dominating set D of an IFG G = (V, E) is a non-split dominating set, if the induced intuitionistic fuzzy subgraph 〈ܸ − 〉ܦ is connected. The Non-split domination number ߛ ௦ ሺܩሻ of IFG G is the minimum cardinality of all Non-split dominating set. In this paper we study some theorems in Non-split dominating sets of IFG and some results of ߛ ௦ ሺܩሻwith other known parameters of IFG G. 1. In...
متن کاملSOME REMARKS ON ALMOST UNISERIAL RINGS AND MODULES
In this paper we study almost uniserial rings and modules. An R−module M is called almost uniserial if any two nonisomorphic submodules are linearly ordered by inclusion. A ring R is an almost left uniserial ring if R_R is almost uniserial. We give some necessary and sufficient condition for an Artinian ring to be almost left uniserial.
متن کاملRemarks on the Complexity of Non-negative Signed Domination
This paper is motivated by the concept of nonnegative signed domination that was introduced by Huang, Li, and Feng in 2013 [15]. We study the non-negative signed domination problem from the theoretical point of view. For networks modeled by strongly chordal graphs and distance-hereditary graphs, we show that the non-negative signed domination problem can be solved in polynomial time. For networ...
متن کاملRemarks on the Complexity of Signed k-Domination on Graphs
This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem on graphs. For any fixed nonnegative integer k, we show that the signed k-domination problem is NP-complete for doubly chordal graphs. For strongly chordal graphs and distance-hereditary graphs, we show that the signed k-domination problem can be solved in polynomial time. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 46 شماره
صفحات -
تاریخ انتشار 2004